An Interactive Image Segmentation Algorithm Based on Graph Cut
نویسندگان
چکیده
منابع مشابه
An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut
Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filt...
متن کاملColor Image Segmentation Based on an Iterative Graph Cut Algorithm Using Time-of-Flight Cameras
This work describes an approach to efficient color image segmentation by supporting an iterative segmentation algorithm with depth data collected by time-of-flight cameras. The algorithm uses an energy minimization approach to segment an image, taking account of both color and region information. The minimization itself is performed by formulating an equivalent minimum cut problem on an image g...
متن کاملInteractive grain image segmentation using graph cut algorithms
Segmenting materials images is a laborious and time-consuming process and automatic image segmentation algorithms usually contain imperfections and errors. Interactive segmentation is a growing topic in the areas of image processing and computer vision, which seeks to nd a balance between fully automatic methods and fullymanual segmentation processes. By allowing minimal and simplistic interact...
متن کاملMultiregion Graph Cut Image Segmentation
The purpose of our study is two-fold: (1) investigate an image segmentation method which combines parametric modeling of the image data and graph cut combinatorial optimization and, (2) use a prior which allows the number of labels/regions to decrease when the number of regions is not known and the algorithm initialized with a larger number. Experimental verification shows that the method resul...
متن کاملJoint graph cut and relative fuzzy connectedness image segmentation algorithm
We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.01.149